Embedding infinitely parallel computation in Newtonian kinematics
نویسندگان
چکیده
منابع مشابه
Embedding infinitely parallel computation in Newtonian kinematics
First, we reflect on computing sets and functions using measurements from experiments with a class of physical systems. We call this experimental computation. We outline a programme to analyse theoretically experimental computation in which a central problem is: Given a physical theory T , explore and classify the computational models that can be embedded in, and abstracted from, the physical s...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملGalactic kinematics with modified Newtonian dynamics
We look for observational signatures that could discriminate between Newtonian and modified Newtonian (MOND) dynamics in the Milky Way, in view of the advent of large astrometric and spectroscopic surveys. Indeed, a typical signature of MOND is an apparent disk of “phantom” dark matter, which is uniquely correlated with the visible disk-density distribution. Due to this phantom dark disk, Newto...
متن کاملForward Position Kinematics of a Parallel Manipulator with New Architecture
The forward position kinematics (FPK) of a parallel manipulator with new architecture supposed to be used as a moving mechanism in a flight simulator project is discussed in this paper. The closed form solution for the FPK problem of the manipulator is first determined. It has, then, been shown that there are at most 24 solutions for FPK problem. This result has been verified by using other tec...
متن کاملFast Equilibrium Computation for Infinitely Repeated Games
It is known that an equilibrium of an infinitely repeated two-player game (with limit average payoffs) can be computed in polynomial time, as follows: according to the folk theorem, we compute minimax strategies for both players to calculate the punishment values, and subsequently find a mixture over outcomes that exceeds these punishment values. However, for very large games, even computing mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2006
ISSN: 0096-3003
DOI: 10.1016/j.amc.2005.09.068